翻訳と辞書 Words near each other ・ Transposed letter effect ・ Transposer ・ Transposing instrument ・ Transposing piano ・ Transposition ・ Transposition (chess) ・ Transposition (law) ・ Transposition (logic) ・ Transposition (music) ・ Transposition (telecommunications) ・ Transposition cipher ・ Transposition of the great vessels ・ Transposition table ・ Transposition tower ・ Transposition, docking, and extraction ・ Transposition-driven scheduling ・ Transpositional modulation ・ Transpositional pun ・ Transposon mutagenesis ・ Transposon sequencing ・ Transposon silencing ・ Transposon tagging ・ Transposons as a genetic tool ・ Transpoviron ・ Transpower ・ Transpower New Zealand ・ Transpression ・ Transpromotional ・ Transpulmonary pressure ・ Transputer Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Transposition-driven scheduling ： ウィキペディア英語版 Transposition-driven scheduling Transposition driven scheduling (TDS) is a load balancing algorithm for parallel computing. It was developed at the Vrije Universiteit in Amsterdam, The Netherlands as an algorithm to solve puzzles. The algorithm provides near-linear speedup with some problems and scales extremely well. It was published〔 〕 about by John Romein, Aske Plaat, Henri Bal and Jonathan Schaeffer. == Transposition based puzzle solving == In a puzzle, all possible plays can be represented in a tree with board positions corresponding to the nodes, moves corresponding to the edges, the initial position as the root of the tree and the solutions as leaves. Cycles in a path, i.e. moves that yield a position that is already encountered higher up in the tree, are left out of the tree because they can never lead to an optimal solution. In most puzzles, different ordering of actions can lead to the same position of the puzzle. In puzzles where previous actions do not influence the solution, you need to only evaluate this position once to get a solution for both paths. To avoid evaluating the same position more than once (and thus wasting computation cycles), programs written to solve these kinds of puzzles use transposition tables. A transposition is a puzzle state that can be reached by different paths but has the same solution. Every time such a program starts evaluating a position, it first looks up in a table if the position has already been evaluated. If it has, the solution is taken from the table instead of calculated, saving large amounts of time. However, in parallel computing, this approach has a serious drawback. To make full use of the advantages of transposition lookups, all computers in the network have to communicate their solutions to the other computers one way or the other, or you run the risk of redundantly solving some positions. This incurs a severe communication overhead, meaning that a lot of all computers' time is spent communicating with the others instead of solving the problem. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Transposition-driven scheduling」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.